SMT-based Abstract Temporal Planning

نویسندگان

  • Artur Niewiadomski
  • Wojciech Penczek
چکیده

An abstract planning is the rst phase of the web service composition in the Planics framework. A user query speci es the initial and the expected state of a plan in request. The paper extends Planics with a module for temporal planning, by extending the user query with an LTL−X formula specifying temporal aspects of world transformations in a plan. Our solution comes together with an example, an implementation, and experimental results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Temporal Planning with Clock-Based SMT Encodings

We propose more scalable encodings of temporal planning in SMT. The first contribution is practical clock-based encodings of resources and effect delays. Existing encodings of effect delays (Shin and Davis, 2015) have a quadratic size, due to the necessity to determine the time differences between steps for a linear number of steps. Clocks improve this to linear. The second contribution is a ne...

متن کامل

Dissertation Abstract: SAT/SMT techniques for planning problems

Although a lot of work has been devoted to the encoding of planning tasks to propositional logic, only a few works can be found in the literature on satisfiability based approaches to planning in domains that require numeric reasoning. This is probably due to the difficulty of efficiently handling at the same time numeric constraints and propositional formulas. Surprisingly, satisfiability modu...

متن کامل

Dissertation Abstract: Sat/smt Techniques for Planning Problems

Although a lot of work has been devoted to the encoding of planning tasks to propositional logic, only a few works can be found in the literature on satisfiability based approaches to planning in domains that require numeric reasoning. This is probably due to the difficulty of efficiently handling at the same time numeric constraints and propositional formulas. Surprisingly, satisfiability modu...

متن کامل

SMT Spatio-Temporal Planning

Solving real planning problems requires to consider spatial and temporal information. Indeed, to be solved more efficiently many real world problems need to take the action duration, the instants of effects occurrences, the instants of requiring preconditions. . . and the space in which the mission is accomplished by defining the different actions zones and know the path between these zones int...

متن کامل

Hybrid Planning by Combining SMT and Simulated Annealing

We present a new approach to the concrete planning (CP) shown to be a NP-hard problem [7]. This is the third stage of Web service composition (WSC) in the PlanICS framework [1]. The first two phases, namely an abstract planning and offer collecting, basing on an ontology, a user query, and a service registry provide data necessary for CP. A new hybrid algorithm (HSA), which combines Simulated A...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014